Fountain Communication using Concatenated Codes
نویسندگان
چکیده
منابع مشابه
Fountain Codes
Fountain codes are record-breaking sparse-graph codes for channels with erasures – such as the internet, where files are transmitted in multiple small packets, each of which is either received without error or not received. Standard file-transfer protocols simply chop a file up into K packet-sized pieces, then repeatedly transmit each packet until it is successfully received. A back-channel is ...
متن کاملNetwork Coding based flooding using Fountain Codes
Multipoint relays ”MPR” have been introduced in the proactive protocol OLSR in order to optimize the flooding overhead of control traffic. In this paper we propose a protocol NFCF to optimize the Network Coding based flooding using Fountain Codes such as LT code. our protocol combine the MPR technique with the notion of network coding where MPR nodes do not simply forward packets they overhear ...
متن کاملCooperative Relay Networks Using Fountain Codes
We investigate a cooperative communications scheme with N parallel relays, where both the transmissions from the source to the relays and from the relays to the destination use fountain codes. Receiver for codes can accumulate mutual information, while traditional energy collection methods, such as repetition or cooperative space-time codes, only accumulate energy. As a consequence, using fount...
متن کامل6.972 PRINCIPLES OF DIGITAL COMMUNICATION II Fountain Codes
3 Tornado Codes 5 3.1 Code Construction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 3.2 Optimal Degree Sequences . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.3 Practical Considerations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 3.3.1 Matlab Implementation . . . . . . . . . . . . . . . . . . . . . . . . . ....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2013
ISSN: 0090-6778
DOI: 10.1109/tcomm.2012.09.110674